Solving absolute value equation using complementarity and smoothing functions

نویسندگان

  • L. Abdallah
  • Mounir Haddou
  • Tangi Migot
چکیده

In this paper, we reformulate the NP-hard problem of the absolute value equation (AVE) as a horizontal linear complementarity one and then solve it using a smoothing technique. This approach leads to a new class of methods that are valid for general absolute value equation. An asymptotic analysis proves the convergence of our schemes and provides some interesting error estimates. This kind of error bound or estimate had never been studied for other known methods. The corresponding algorithms were tested on randomly generated problems and applications. These experiments show that, in the general case, one observes a reduction of the number of failures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Augmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems

One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...

متن کامل

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities

In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementarity problem (NCP) and the box constrained variational inequalities (BVI). Instead of using an infinite sequence of smoothing approximation functions, we use a single smoothing approximation function and Robinson’s normal equation to reformulate NCP and BVI as an equivalent nonsmooth equation H(u, ...

متن کامل

A Smoothing Technique for the Minimum Norm Solution of Absolute Value Equation

One of the issues that has been considered by the researchers in terms of theory and practice is the problem of finding minimum norm solution. In fact, in general, absolute value equation may have infinitely many solutions. In such cases, the best and most natural choice is the solution with the minimum norm. In this paper, the minimum norm-1 solution of absolute value equation is investigated. ...

متن کامل

A class of smoothing functions for nonlinear and mixed complementarity problems

We propose a class of parametric smooth functions that approximate the fundamental plus function, (x) + =maxf0; xg, by twice integrating a probability density function. This leads to classes of smooth parametric nonlinear equation approximations of nonlinear and mixed complementarity problems (NCPs and MCPs). For any solvable NCP or MCP, existence of an arbitrarily accurate solution to the smoo...

متن کامل

Absolute value programming

We investigate equations, inequalities and mathematical programs involving absolute values of variables such as the equation Ax + B|x| = b, where A and B are arbitrary m × n real matrices. We show that this absolute value equation is NP-hard to solve, and that solving it solves the general linear complementarity problem. However, we propose a concave minimization problem for its solution that i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 327  شماره 

صفحات  -

تاریخ انتشار 2018